Minimal invasion: An optimal L∞state constraint problem
نویسندگان
چکیده
منابع مشابه
Minimal Invasion: an Optimal L∞ State Constraint Problem
In this work, the least pointwise upper and/or lower bounds on the state variable on a specified subdomain of a control system under piecewise constant control action are sought. This results in a non-smooth optimization problem in function spaces. Introducing a Moreau-Yosida regularization of the state constraints, the problem can be solved using a superlinearly convergent semi-smooth Newton m...
متن کاملAn optimal stopping problem with a reward constraint
This article studies an optimal stopping problem with an endogenous constraint on the set of admissible stopping times. The constraint stipulates that continuation is permitted, at any given date t, only if the endogenous reward achieved exceeds a prespecified threshold. Characterizations of the value function and the optimal stopping time are presented. An application to the pricing of corpora...
متن کاملAn Optimal Constraint Programming Approach to the Open-Shop Problem
This is a summary of the journal article (Malapert et al. 2012) published by Journal on Computing entitled “An Optimal Constraint Programming Approach to the Open-Shop Problem”. The article presents an optimal constraint programming approach for the Open-Shop scheduling problem, which integrates recent constraint propagation and branching techniques with new upper bound heuristics. Randomized r...
متن کاملTrain Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem
The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...
متن کاملOn the Minimal Constraint Satisfaction Problem: Complexity and Generation
The Minimal Constraint Satisfaction Problem, or Minimal CSP for short, arises in a number of real-world applications, most notably in constraint-based product configuration. Despite its very permissive structure, it is NP-hard, even when bounding the size of the domains by d ≥ 9. Yet very little is known about the Minimal CSP beyond that. Our contribution through this paper is twofold. Firstly,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis
سال: 2010
ISSN: 0764-583X,1290-3841
DOI: 10.1051/m2an/2010064